Complete theory - PDFSEARCH.IO - Document Search Engine

Complete theory
Results: 1780

#	Item
121	Robust Reoptimization of Steiner Trees∗ Keshav Goyal1 and Tobias Mömke2 1 2 IIT Delhi, India, Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2015-12-11 12:58:32 Graph theory Computational complexity theory Mathematics NP-complete problems Spanning tree Steiner tree problem Operations research Knowledge representation Edsger W. Dijkstra Minimum spanning tree Travelling salesman problem Approximation algorithm
122	Algorithmica:385–414 DOIs00453Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs George B. Mertzios · Paul G. Spirakis Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2016-01-12 16:30:06 Graph theory NP-complete problems Graph coloring Triangle-free graph Treewidth Independent set Planar graph Line graph Perfect graph Dominating set Clique cover Graph minor
123	Genome Informatics 13: 143–Point Matching Under Non-Uniform Distortions and Protein Side Chain Packing Based on an Efficient Add to Reading List Source URL: www.jsbi.org Language: English - Date: 2002-12-09 05:53:39 Graph theory Mathematics Computational complexity theory NP-complete problems Independent set Clique problem Algorithm Clique Matching
124	Microsoft Word - musicExplorerLab.doc Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:37:03 Graph theory Computational complexity theory Mathematics Edsger W. Dijkstra Network theory Topological graph theory Shortest path problem M3U NP-complete problems
125	TOCS9478_source.nohead.pdf Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2013-05-14 08:02:16 Graph theory NP-complete problems Circle graph Intersection graph Dominating set Interval graph Chordal graph Graph coloring Treewidth Claw-free graph Clique Planar graph
126	RAMIFICATION THEORY AND PERFECTOID SPACES SHIN HATTORI Abstract. Let K1 and K2 be complete discrete valuation fields of residue characteristic p > 0. Let πK1 and πK2 be their uniformizers. Let L1 /K1 and L2 /K2 be fini Add to Reading List Source URL: www2.math.kyushu-u.ac.jp Language: English - Date: 2013-09-28 06:49:36 Algebra Abstract algebra Mathematics Field theory Commutative algebra Ring theory Localization Algebraic structures Valuation Discrete valuation ring Discrete valuation P-adic number
127	CS264: Homework #8 Due by midnight on Wednesday, November 19, 2014 Instructions: (1) Students taking the course pass-fail should complete the exercises. Students taking the course for a letter grade should also complete Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-11-14 09:53:16 Computational complexity theory Operations research Theory of computation Mathematics Knapsack problem Optimization problem NP Mathematical optimization Polynomial-time approximation scheme Dynamic programming Time complexity Isolation lemma
128	Output-Sensitive Construction of the Union of Triangles Esther Ezra and Micha Sharir School of Computer Science Add to Reading List Source URL: www.math.tau.ac.il Language: English - Date: 2007-08-27 22:45:23 Computational complexity theory Theory of computation Analysis of algorithms NP-complete problems Set cover problem Randomized algorithm Time complexity Minimum spanning tree Point location
129	CS681: Advanced Topics in Computational Biology Week 7 Lectures 2-3 Can Alkan EA224 Add to Reading List Source URL: www.cs.bilkent.edu.tr Language: English - Date: 2012-03-26 04:52:47 Graph theory Mathematics Computational complexity theory NP-complete problems Hamiltonian path Eulerian path Travelling salesman problem Cycle Seven Bridges of Knigsberg Path NP-completeness Shortest path problem
130	The breakpoint distance for signed sequences (extended abstract) Guillaume Blin1 , Cedric Chauve2 and Guillaume Fertin1 1 2 Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2009-07-03 08:56:58 Computational complexity theory Graph theory Mathematics NP-complete problems Combinatorial optimization Matching Vertex cover Gene

UPDATE